Graph colouring via the probabilistic method
نویسنده
چکیده
منابع مشابه
Randomly colouring graphs (a combinatorial view)
The application of the probabilistic method to graph colouring has been yielding interesting results for more than 40 years. Several probabilistic tools are presented in this survey, ranging from the basic to the more advanced. For each of them, an application to a graph colouring problem is presented in detail. In this way, not only is the general idea of the method exposed, but also are the c...
متن کاملProbabilistic Graph Programming
We introduce a notion of probability to the graph programming language GP2 which resolves nondeterministic choices of graph transformation rules and their matches. With our programming model Probabilistic GP2 (P-GP2), rule and match decisions are assigned uniform distributions over their domains. In this paper, we present an implementation of P-GP2 as an extension of an existing GP2 compiler. A...
متن کاملThe Strong Chromatic Index of Graphs
The strong chromatic index of graphs Mohammad Mahdian Master of Science Graduate Department of C o m p t e r Science University of Toronto 2000 A strong edge-colouring of a graph G is an assignrnent of colours to the edges of G such that every colour class is an induced matching. The minimum number of colours in such a colouring is called the strong chromatic index of G. In 1985, Erdos and Nese...
متن کاملTackling the edge dynamic graph colouring problem with and without future adjacency information
Many real world operational research problems, such as frequency assignment and exam timetabling, can be reformulated as graph colouring problems (GCPs). Most algorithms for theGCPoperate under the assumption that its constraints are fixed, allowing us to model the problem using a static graph. However, in many real-world cases this does not hold and it is more appropriate to model problems wit...
متن کاملSolving 3-Colouring via 2SAT
The 3-Colouring of a graph is a classic NP-complete problem. We show that some solutions for the 3-Colouring can be built in polynomial time based on the number of basic cycles existing in the graph. For this, we design a reduction from proper 3-Colouring of a graph G to a 2-CF Boolean formula FG, where the number of clauses in FG depends on the number of basic cycles in G. Any model of FG prov...
متن کامل